Pii: S0168-9274(01)00131-3
نویسندگان
چکیده
We present in this paper optimal and accelerated row projection algorithms arising from the use of quadratic programming, that allow us to define the iterate xk+1 as the projection of x onto a hyperplane which minimizes its distance to the solution x∗. These algorithms also use a novel partition strategy into blocks based on sequential estimations of their condition numbers. 2001 IMACS. Published by Elsevier Science B.V. All rights reserved.
منابع مشابه
Pii: S0168-9274(99)00131-2
We study numerical integrators that contract phase space volume even when the ODE does so at an arbitrarily small rate. This is done by a splitting into two-dimensional contractive systems. We prove a sufficient condition for Runge–Kutta methods to have the appropriate contraction property for these two-dimensional systems; the midpoint rule is an example. 2000 IMACS. Published by Elsevier Sc...
متن کاملPii: S0168-9274(98)00131-7
In the present paper suboptimal boundary control strategies for the time-dependent, incompressible flow over the backward-facing step are considered. The objective consists in the reduction of the recirculation bubble of the flow behind the step. Several cost functionals are suggested and a frame for the derivation of the optimality systems for a general class of cost functionals is presented. ...
متن کاملPii: S0168-9274(01)00134-9
A postprocessing technique to improve the accuracy of Galerkin methods, when applied to dissipative partial differential equations, is examined in the particular case of very smooth solutions. Pseudospectral methods are shown to perform poorly. This performance is studied and a refined postprocessing technique is proposed. 2002 IMACS. Published by Elsevier Science B.V. All rights reserved.
متن کاملPii: S0168-9274(01)00181-7
An energy-preserving explicit extension operator is proposed to extend finite element functions defined on the boundary of a star-shaped polygonal domain into its interior. The pre-assigned finite element triangulation in the interior of the domain needs not be multilevel-structured. The extension operator has wide applications in the construction of non-overlapping domain decomposition methods...
متن کاملPii: S0168-9274(99)00020-3
We compare several methods for sensitivity analysis of differential–algebraic equations (DAEs). Computational complexity, efficiency and numerical conditioning issues are discussed. Numerical results for a chemical kinetics problem arising in model reduction are presented. 2000 IMACS. Published by Elsevier Science B.V. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002